BDD Decomposition for Efficient Logic Synthesis
نویسندگان
چکیده
There are two major approaches to the synthesis of logic circuits. One is based on a predominantly algebraic factorization leading to AND/OR logic optimization. The other is based on classical Reed-Muller decompositionmethod and its related decision diagrams, which have been shown to be efficient for XOR-intensive arithmetic functions. Both approaches share the same characteristics: while one is strong at one class of functions, it is weak at the other’s. In this paper, we propose a unified logic optimizationmethod which proves very efficient at handling bothAND/OR-intensive andXOR-intensive functions. The proposed method is based on iterative BDD decomposition using various dominators. Detail analysis of decomposable BDD structures leading to AND/OR, XORandMUXdecompositions arepresented. Experiment shows that our synthesis results for AND/OR-intensive functions are comparable to those of SIS, and results for XOR-intensive functions are comparable to those of techniques targeting XOR decomposition.
منابع مشابه
BDS : A BDD - Based Logic Optimization System
This paper describes a novel logic decomposition theory and a practical logic synthesis system, BDS. It is based on a new binary decision diagrams (BDD) decomposition technique which supports all types of decomposition structures, including AND, OR, XOR, and complex MUX, both algebraic and Boolean. As a result, the method is very efficient in synthesizing both AND/OR and XOR-intensive functions...
متن کاملAdvances in Functional Decomposition: Theory and Applications
Functional decomposition aims at finding efficient representations for Boolean functions. It is used in many applications, including multi-level logic synthesis, formal verification, and testing. This dissertation presents novel heuristic algorithms for functional decomposition. These algorithms take advantage of suitable representations of the Boolean functions in order to be efficient. The fi...
متن کاملAnd Ciesielski : Efficient Bdd - Based Logic Decomposition
| This paper introduces a new decomposition method for Boolean functions. It is based on generalized dominators, which provide eecient means to generate both conjunctive divisors and disjunctive \deductors". Concise factored form representation of a Boolean function can be obtained by performing BDD decomposition iteratively. The choice of the decomposition type depends on the cost of the gener...
متن کاملDecomposition-based logic synthesis for PAL-based CPLDs
The paper presents one concept of decomposition methods dedicated to PAL-based CPLDs. The proposed approach is an alternative to the classical one, which is based on two-level minimization of separate single-output functions. The key idea of the algorithm is to search for free blocks that could be implemented in PAL-based logic blocks containing a limited number of product terms. In order to be...
متن کاملFSM Encoding for BDD Representations
Reduced Ordered Binary Decision Diagrams (ROBDDs or simply BDDs) are a data structure used to efficiently represent and manipulate logic functions. They were introduced by Bryant (1986). Since then, they have played a major role in many areas of computer aided design, including logic synthesis, simulation, and formal verification. The size of a BDD representing a logic function depends on the o...
متن کامل